Fault tolerant communication algorithms on the star network using disjoint paths
نویسندگان
چکیده
One way to achieve fault tolerant communication on in2erconneclion networks is by exploiting and effectively utilizing Ihe disjoint paths 2hai exist between pairs of source and destination nodes. In this paper, we construc2 a graph lhal consisls of n 1 directed edgedisjoint spanning trees on the star network. This graph is used lo derive fault tolerant algorithms for the singlenode and mullinode broadcasting, and for the singlenode and mullinode scattering problems under fhe allport communica2ion assumption. Fault tolerance is achieved by transmitting Ihe same messages through a number of edge-disjoint spanning trees. These algorithms operate successfully in the presence of up to n 2 faulty nodes or edges in Ihe network.
منابع مشابه
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
Data communication and fault tolerance are important issues in multiprocessor systems. One way to achieve fault tolerant communication is by exploiting and e ectively utilizing the disjoint paths that exist between pairs of source, destination nodes. In this paper we construct a structure, called the multiple edgedisjoint spanning trees, on the star network, denoted by Sn. This is used for the ...
متن کاملEdge - Disjoint Spanning Trees on the Star Network with Applications To
Data communication and fault tolerance are important issues in multiprocessor systems. One way to achieve fault tolerant communication is by exploiting and e ectively utilizing the disjoint paths that exist between pairs of source, destination nodes. In this paper we construct a structure, called the multiple edgedisjoint spanning trees, on the star network, denoted by Sn. This is used for the ...
متن کاملFault-tolerant maximal local-connectivity on Bubble-sort star graphs
An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. Connectivity is an important measurement for the fault tolerant in interconnection network. Two vertices is maximally local-connected if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vert...
متن کاملOn strong fault tolerance (or strong Menger-connectivity) of multicomputer networks
On Strong Fault Tolerance (or Strong Menger-Connectivity) of Multicomputer Networks. (August 2004) Eunseuk Oh, B.S., Hallym University, Korea; M.S., Ewha Womans University, Korea Chair of Advisory Committee: Dr. Jianer Chen As the size of networks increases continuously, dealing with networks with faulty nodes becomes unavoidable. In this dissertation, we introduce a new measure for network fau...
متن کاملFault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network
In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2r nodes. In contrast, a dual-cube with r links for...
متن کامل